An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron

In this paper, we concentrate on generating cutting planes for the unsplittable capacitated network design problem. We use flow arc-set polyhedron of considered problem as a substructure and generate by solving separation over it. To relieve computational burden, show that, in some special cases, closed form can be derived. For general case, brute-force algorithm, called exact is employed such that constructed inequality guarantees to facet-defining. Furthermore, new technique presented accelerate which significantly decreases number iterations algorithm. Finally, comprehensive study demonstrate effectiveness proposed